On conditional independence and log-convexity
نویسندگان
چکیده
منابع مشابه
Marginal log-linear parameterization of conditional independence models
Models defined by a set of conditional independence restrictions play an important role in statistical theory and applications, especially, but not only, in graphical modeling. In this paper we identify a subclass of these consisting of hierarchical marginal log-linear models, as defined by Bergsma and Rudas (2002a). Such models are smooth, which implies the applicability of standard asymptotic...
متن کاملBell Numbers, Log-concavity, and Log-convexity
Let fb k (n)g 1 n=0 be the Bell numbers of order k. It is proved that the sequence fb k (n)=n!g 1 n=0 is log-concave and the sequence fb k (n)g 1 n=0 is log-convex, or equivalently, the following inequalities hold for all n 0, 1 b k (n + 2)b k (n) b k (n + 1) 2 n + 2 n + 1 : Let f(n)g 1 n=0 be a sequence of positive numbers with (0) = 1. We show that if f(n)g 1 n=0 is log-convex, then (n)(m) (n...
متن کاملPropositional Independence Conditional independence
Independence – the study of what is relevant to a given problem of reasoning – is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl’s conditional independence, and two more restricted forms of it, called strong conditional independence and perfect conditional independence. Many characterizations and proper...
متن کاملConditional independence, conditional mixing and conditional association
Some properties of conditionally independent random variables are studied. Conditional versions of generalized Borel-Cantelli lemma, generalized Kolmogorov’s inequality and generalized Hájek-Rényi inequality are proved. As applications, a conditional version of the strong law of large numbers for conditionally independent random variables and a conditional version of the Kolmogorov’s strong law...
متن کاملOn the log-convexity of combinatorial sequences
Here presented is a survey for the log-convexity of some famous combinatorial sequences. We develop techniques for dealing with the log-convexity of sequences satisfying a three-term recurrence. We also introduce the concept of q-log-convexity and establish the link with linear transformations preserving the log-convexity. MSC: 05A20; 11B73; 11B83; 11B37
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2012
ISSN: 0246-0203
DOI: 10.1214/11-aihp431